Cube-like Polytopes and Complexes

نویسندگان

  • Andrew Duke
  • Egon Schulte
چکیده

The main purpose of this paper is to popularize Danzer’s power complex construction and establish some new results about covering maps between two power complexes. Power complexes are cube-like combinatorial structures that share many structural properties with higher-dimensional cubes and cubical tessellations on manifolds. Power complexes that are also abstract polytopes have repeatedly appeared somewhat unexpectedly in various contexts, although often under a different name. However, the non-polytope case is largely unexplored.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Edge Expansion of Cubical Complexes

In this paper we show that graphs of “neighbourly” cubical complexes – cubical complexes in which every pair of vertices spans a (unique) cube – have good expansion properties, using a technique based on multicommodity flows. By showing that graphs of stable set polytopes are graphs of neighbourly cubical complexes we give a new proof that graphs of stable set polytopes have edge expansion 1.

متن کامل

Counting faces of cubical spheres modulo two

Several recent papers have addressed the problem of characterizing the f -vectors of cubical polytopes. This is largely motivated by the complete characterization of the f -vectors of simplicial polytopes given by Stanley, Billera, and Lee in 1980 [19] [4]. Along these lines Blind and Blind [5] have shown that unlike in the simplicial case, there are parity restrictions on the f -vectors of cub...

متن کامل

Neighborly Cubical Polytopes

Neighborly cubical polytopes exist: for any n ≥ d ≥ 2r + 2, there is a cubical convex d-polytope C d whose r-skeleton is combinatorially equivalent to that of the n-dimensional cube. This solves a problem of Babson, Billera & Chan. Kalai conjectured that the boundary ∂C d of a neighborly cubical polytope C n d maximizes the f -vector among all cubical (d− 1)-spheres with 2 vertices. While we sh...

متن کامل

On the Chvátal Rank of Polytopes in the 0/1 Cube

Given a polytope P⊆Rn, the Chv atal–Gomory procedure computes iteratively the integer hull PI of P. The Chv atal rank of P is the minimal number of iterations needed to obtain PI . It is always nite, but already the Chv atal rank of polytopes in R can be arbitrarily large. In this paper, we study polytopes in the 0=1 cube, which are of particular interest in combinatorial optimization. We show ...

متن کامل

ar X iv : 0 80 6 . 11 27 v 2 [ m at h . N A ] 1 4 Ju l 2 00 8 Multivariate Splines and Polytopes ∗

In this paper, we use multivariate splines to investigate the volume of polytopes. We first present an explicit formula for the multivariate truncated power, which can be considered as a dual version of the famous Brion’s formula for the volume of polytopes. We also prove that the integration of polynomials over polytopes can be dealt with by the multivariate truncated power. Moreover, we show ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012